A general purpose Hyper – Heuristic based on Ant colony optimization

نویسندگان

  • José Luis Núñez
  • Alberto Ceballos
چکیده

In the plan of the CHESC2001 competition [1], an hyper heuristic has been designed based on the Ant Colony Optimization method (from now ACO). According to the competition goals, the algorithm was developed with the intention to produce an independent model of the problem domain and the particular instance to be solved. This means that the hyper-heuristic is abstracted from the features of each heuristic previously known; therefore, the work is based exclusively on the behavior observed during the problem resolution. These types of hyper-heuristics are known as heuristic selection and online learning [2]. The model presented in this document was implemented for Hyflex framework [3] provided for the participatants in the competition.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Ant-Based Selection Hyper-heuristic for Dynamic Environments

Dynamic environment problems require adaptive solution methodologies which can deal with the changes in the environment during the solution process for a given problem. A selection hyper-heuristic manages a set of low level heuristics (operators) and decides which one to apply at each iterative step. Recent studies show that selection hyperheuristic methodologies are indeed suitable for solving...

متن کامل

Multi-objective Reconfiguration of Distribution Network Using a Heuristic Modified Ant Colony Optimization Algorithm

In this paper, a multi-objective reconfiguration problem has been solved simultaneously by a modified ant colony optimization algorithm. Two objective functions, real power loss and energy not supplied index (ENS), were utilized. Multi-objective modified ant colony optimization algorithm has been generated by adding non-dominated sorting technique and changing the pheromone updating rule of ori...

متن کامل

Ant Colony Optimization For The Edge-weighted k-cardinality Tree Problem

In this paper we deal with an NP -hard combinatorial optimization problem, the kcardinality tree problem in edge-weighted graphs. This problem has several applications in practice, which justify the need for eÆcient methods to obtain good solutions. Metaheuristic applications have already been shown to be successful in tackling the kcardinality tree problem in the past. In this paper we propose...

متن کامل

Solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization

One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...

متن کامل

Hybrid Improved Dolphin Echolocation and Ant Colony Optimization for Optimal Discrete Sizing of Truss Structures

This paper presents a robust hybrid improved dolphin echolocation and ant colony optimization algorithm (IDEACO) for optimization of truss structures with discrete sizing variables. The dolphin echolocation (DE) is inspired by the navigation and hunting behavior of dolphins. An improved version of dolphin echolocation (IDE), as the main engine, is proposed and uses the positive attributes of an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011